Translation of Aggregate Programs to Normal Logic Programs
نویسندگان
چکیده
We define a translation of aggregate programs to normal logic programs which preserves the set of partial stable models. We then define the classes of definite and stratified aggregate programs and show that the translation of such programs are, respectively, definite and stratified logic programs. Consequently these two classes of programs have a single partial stable model which is two-valued and is also the wellfounded model. Our definition of stratification is more general than the existing one and covers a strictly larger class of programs.
منابع مشابه
On Logic Programming with Aggregates
In this paper, we present a translational semantics for normal logic programs with aggregates. We propose two different translations of logic programs with aggregates into normal logic programs, whose answer set semantics is used to defined the semantics of the original programs. Differently from many of the earlier proposals in this area, our semantics does not impose any syntactic restriction...
متن کاملLevel Mapping Induced Loop Formulas for Weight Constraint and Aggregate Logic Programs
Level mapping and loop formulas are two different means to justify and characterize answer sets for normal logic programs. Both of them specify conditions under which a supported model is an answer set. Though serving a similar purpose, in the past the two have been studied largely in isolation with each other. In this paper, we study level mapping and loop formulas for weight constraint and ag...
متن کاملRelating Defeasible Logic to the Well-Founded Semantics for Normal Logic Programs
The most recent version of defeasible logic (Nute 1997) is related to the well-founded semantics by translating defeasible theories into normal logic programs. A correspondence is shown between the assertions of a defeasible theory and the literals contained in the well-founded model of the translation. The translation scheme is based upon (Antoniou & Maher 2002) but is modified to account for ...
متن کاملDisjunctive Logic Programs versus Normal Logic Programs
This paper focuses on the expressive power of disjunctive and normal logic programs under the stable model semantics over finite, infinite, or arbitrary structures. A translation from disjunctive logic programs into normal logic programs is proposed and then proved to be sound over infinite structures. The equivalence of expressive power of two kinds of logic programs over arbitrary structures ...
متن کاملA Well-Founded Semantics for Basic Logic Programs with Arbitrary Abstract Constraint Atoms
Logic programs with abstract constraint atoms proposed by Marek and Truszczynski are very general logic programs. They are general enough to capture aggregate logic programs as well as recently proposed description logic programs. In this paper, we propose a wellfounded semantics for basic logic programs with arbitrary abstract constraint atoms, which are sets of rules whose heads have exactly ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003